Minimizing Randomness in Minimum Spanning Tree, Parallel Conne tivity, and Set Maxima Algorithms
نویسنده
چکیده
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملRandomized Parallel Algorithms for Combinatorial Optimization
In this paper we show some important randomization techniques for the parallel processing of discrete problems. In particular, we present several parallel randomized algorithms frequently used for sorting, packet routing, shortest paths problems, matching problems, depth rst search, minimum cost spanning trees, and maximal independent set problems. We also discuss the connection between randomi...
متن کاملLecture notes for “Advanced Graph Algorithms”: Verification of Minimum Spanning Trees
We present a deterministic linear time algorithm for the Tree Path Maxima problem. As a corollary, we obtain a deterministic linear time algorithm for checking whether a given spanning tree T of a weighted graph is a minimum spanning tree.
متن کاملClustering with Minimum Spanning Trees
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of a set of representative points and removes edges that satisfy a predefined criterion. The process is repeat...
متن کاملDynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions
We maintain the minimum spanning tree of a point set in the plane, subject to point insertions and deletions, in amortized time O(n1/2 log n) per update operation. We reduce the problem to maintaining bichromatic closest pairs, which we solve in time O(n) per update. Our algorithm uses a novel construction, the ordered nearest neighbor path of a set of points. Our results generalize to higher d...
متن کامل